Benders’ decomposition of the unit commitment problem with semidefinite relaxation of AC power flow constraints

In this paper we present a formulation of the unit commitment problem with AC power flow constraints. It is solved by Benders’ decomposition in which master formulated as mixed-integer linearization generation constraints for improved convergence. Semidefinite programming relaxation rectangular optimal used subproblem, providing somewhat conservative cuts. Numerical case studies, including 6-bus and IEEE 118-bus network, are provided to test effectiveness our proposal. We show numerical experiments that use such strategy improves quality feasibility optimality cuts generated solution convex therefore reducing number iterations required algorithm